منابع مشابه
Bisimulations for fuzzy automata
Bisimulations have beenwidely used inmany areas of computer science tomodel equivalence between various systems, and to reduce the number of states of these systems, whereas uniform fuzzy relations have recently been introduced as a means to model the fuzzy equivalence between elements of two possible different sets. Here we use the conjunction of these two concepts as a powerful tool in the st...
متن کاملWeak bisimulations for labelled transition systems weighted over semirings
Weighted labelled transition systems are LTSs whose transitions are given weights drawn from a commutative monoid. WLTSs subsume a wide range of LTSs, providing a general notion of strong (weighted) bisimulation. In this paper we extend this framework towards other behavioural equivalences, by considering semirings of weights. Taking advantage of this extra structure, we introduce a general not...
متن کاملBisimulations Up-to: Beyond First-Order Transition Systems
The bisimulation proof method can be enhanced by employing ‘bisimulations up-to’ techniques. A comprehensive theory of such enhancements has been developed for first-order (i.e., CCS-like) labelled transition systems (LTSs) and bisimilarity, based on the notion of compatible function for fixed-point theory. We transport this theory onto languages whose bisimilarity and LTS go beyond those of fi...
متن کاملCategorical logics for contravariant simulations, partial bisimulations, modal refinements and mixed transition systems
Covariant-contravariant simulation and conformance simulation generalize plain simulation and try to capture the fact that it is not always the case that “the larger the number of behaviors, the better”. We have previously studied some of their properties, showing that they can be presented as particular instances of the general notion of categorical simulation developed by Hughes and Jacobs an...
متن کاملModal Characterisations of Probabilistic and Fuzzy Bisimulations
This paper aims to investigate bisimulation on fuzzy systems. For that purpose we revisit bisimulation in the model of reactive probabilistic processes with countable state spaces and obtain two findings: (1) bisimilarity coincides with simulation equivalence, which generalises a result on finite-state processes originally established by Baier; (2) the modal characterisation of bisimilarity by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Fuzzy Systems
سال: 2011
ISSN: 1063-6706,1941-0034
DOI: 10.1109/tfuzz.2011.2117431